Self-destructing Instant Messages by Employing KAD DHT Network

نویسندگان

  • Yuhui Deng
  • Zhen Zhang
  • Zhike Chen
  • Lijuan Lu
چکیده

YUHUI DENG1,2 , ZHEN ZHANG1, ZHIKE CHEN1 AND LIJUAN LU3 Department of Computer Science, Jinan University, Guangzhou, 510632, P. R. China State Key Laboratory of Computer Architecture, Institute of Computing Technology Chinese Academy of Sciences, Beijing, 100190, P. R. China. School of Business Administration, South China University of Technology, Guangzhou, 510640, P. R. China E-mail: {tyhdeng; zzhang}@jnu.edu.cn

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Load Reduction in the KAD Peer-to-Peer System

Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHTs have been implemented in real systems and deployed on a large scale. One exception is kad, a DHT based on Kademlia, which is part of eDonkey, a peer-topeer file sharing system with several million simultaneous users. In thi...

متن کامل

A performance evaluation of the Kad-protocol

Most efficient peer-to-peer protocols deploy structured overlay networks based on Distributed Hash Tables (DHTs). These have been extensively studied through theoretical simulations and analysis over the last few years. Recently, the popular eMule and aMule file-sharing applications incorporate a widelydeployed Kademlia-based DHT, called Kad. The Kad-network with over a million simultaneous use...

متن کامل

Attacking the kad network - real world evaluation and high fidelity simulation using DVN

The Kad network, an implementation of the Kademlia DHT protocol, supports the popular eDonkey peer-to-peer file sharing network and has over 1 million concurrent nodes. We describe several attacks that exploit critical design weaknesses in Kad to allow an attacker with modest resources to cause a significant fraction of all searches to fail. We measure the cost and effectiveness of these attack...

متن کامل

An Improved Adaptive Routing Algorithm Based on Link Analysis

DHT (Distributed Hash Tables) has been applied to the structured P2P system to achieve information retrieval and positioning efficiently. KAD is a large-scale network protocol based on the XOR metric in practice, which uses DHT technology to improve network salability without central server. However, the increasing malicious pollutes routing tables to reduce seriously the query performance. Thu...

متن کامل

Large-scale monitoring of DHT traffic

Studying deployed Distributed Hash Tables (DHTs) entails monitoring DHT traffic. Commonly, DHT traffic is measured by instrumenting ordinary peers to passively record traffic. In this approach, using a small number of peers leads to a limited (and potentially biased) view of traffic. Alternatively, inserting a large number of peers may disrupt the natural traffic patterns of the DHT and lead to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Inf. Sci. Eng.

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2015